#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

void solve() {
    int n, k;
    cin >> n >> k;
    V<int> w(k + 1, 0), vis(n + 1, 0);
    FOR(i, 1, k) cin >> w[i], w[i] %= (n - i + 1);

    int x = 1;

    FOR(i, 1, k) {
        int t = w[i];
        int p = x;
        while (t--) {
            if (vis[p]) {
                while (vis[p]) {
                    p++;
                    if (p == n + 1) p = 1;
                }

            } else {
                p++;
                if (p == n + 1) p = 1;
                while (vis[p]) {
                    p++;
                    if (p == n + 1) p = 1;
                }
            }
        }
        while (vis[p]) {
            p++;
            if (p == n + 1) p = 1;
        }
        vis[p] = 1;
        cout << p << ' ';
        x = p + 1;
        if (x == n + 1) {
            x = 1;
            while (vis[x]) {
                x++;
                if (x == n + 1) x = 1;
            }
        }
        while (vis[x]) {
            x++;
            if (x == n + 1) x = 1;
        }
    }
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    while (Task--) {
        solve();
    }

    return 0;
}